Number theory—probabilistic, heuristic, and computational approaches
نویسندگان
چکیده
منابع مشابه
Vehicle Routing Problem: Meta-heuristic Approaches
The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...
متن کاملHeuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation
The allocation of fresh produce to shelf space represents a new decision support research area which is motivated by the desire of many retailers to improve their service due to the increasing demand for fresh food. However, automated decision making for fresh produce allocation is challenging because of the very short lifetime of fresh products. This paper considers a recently proposed practic...
متن کاملCognitive architectures combine formal and heuristic approaches.
Quantum probability (QP) theory provides an alternative account of empirical phenomena in decision making that classical probability (CP) theory cannot explain. Cognitive architectures combine probabilistic mechanisms with symbolic knowledge-based representations (e.g., heuristics) to address effects that motivate QP. They provide simple and natural explanations of these phenomena based on gene...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملComputational Number Theory and Algebra
Proof (Continued from the previous class) We have already shown in the previous class that the algorithm halts after polynomially many executions of the while-loop as the index i can decrease for at most O(n logA) times in step 6. In order to complete the proof, we also need to show that the size of the numerator and denominator of any rational number involved in the computation is polynomially...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2002
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(02)80012-8